The Communication Complexity of Gap Hamming Distance
نویسنده
چکیده
In the gap Hamming distance problem, two parties must determine whether their respective strings x; y 2 f0; 1g are at Hamming distance less than n=2 p n or greater than n=2 C p n: In a recent tour de force, Chakrabarti and Regev (STOC ’11) proved the long-conjectured ̋.n/ bound on the randomized communication complexity of this problem. In follow-up work several months ago, Vidick (2010; ECCC TR11-051) discovered a simpler proof. We contribute a new proof, which is simpler yet and a pageand-a-half long.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملOne-sided error communication complexity of Gap Hamming Distance
Assume that Alice has a binary string x and Bob a binary string y, both of length n. Their goal is to output 0, if x and y are at least Lclose in Hamming distance, and output 1, if x and y are at least U -far in Hamming distance, where L < U are some integer parameters known to both parties. If the Hamming distance between x and y lies in the interval (L, U), they are allowed to output anything...
متن کاملSome Bounds on Communication Complexity of Gap Hamming Distance
In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem (GHDnL,U ): Alice and Bob are given binary string of length n and they are guaranteed that Hamming distance between their inputs is either ≤ L or ≥ U for some L < U . They have to output 0, if the first inequality holds, and 1, if the second inequality holds. In this paper we study the communication ...
متن کاملComparing three proofs on the randomized communication complexity of Hamming distance
We compare the proofs by Chakrabarti and Regev (STOC 2011/SICOMP 2012), Sherstov (Theory of Computing 2012), and the commenter (Chicago J. Theor. Comp. Sci. 2012) of a linear lower bound on the randomized communication complexity of the gap Hamming distance problem. Concurrently with and independently of Sherstov’s work [2] published in Theory of Computing, the author of this comment obtained a...
متن کاملInformation Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these techniques involve properties of large submatrices (rectangles) of the truth-table matrix defining a communication problem. The only technique that does not quite fit is information complexity, which has been investig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theory of Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 2011